A catastrophic-cum-restorative queuing system with correlated batch arrivals and variable capacity
نویسندگان
چکیده
New Broadband Communication Networks are playing a key role in providing a variety of multimedia services such as voice, video and data etc. The amount of information per unit time generated by these services varies along the connection duration. There are certain periods in which the information rate increases and others in which it decreases or becomes null. As the sources providing such services are not synchronized several cells may arrive at the same slot. Thus, they (cells) arrive in batches of variable size. Due to the bursty nature of the cell traffic generated by broadband services the arrival process in New Broadband Communication Networks is correlated in nature [1]. TCP is the most commonly used transport protocol for Internet broadband services. Because it is a connection-based protocol, TCP is able to guarantee that each data packet transmitted from a server reaches its intended destination. It transmits cells in batches [2].
منابع مشابه
Transient Analysis of a Single-Server Queue with Fixed-Size Batch Arrivals
The transient analysis of a queuing system with fixed-size batch Poisson arrivals and a single server with exponential service times is presented. The focus of the paper is on the use of the functions that arise in the analysis of the transient behaviour of the queuing system. These functions are shown to be a generalization of the modified Bessel functions of the first kind, with the batch siz...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملA simulation algorithm for a single server retrial queuing system with batch arrivals
Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases. The paper presents a study approach for this kind of systems, based on discrete event simulation. It is shown that the given algorithm has a polynomial complexity. Also, the object-oriented design we used for implem...
متن کاملOn the Transient and Steady-State Analysis of a Special Single Server Queuing System with HOL Priority Scheduling
In this paper, we consider a special discrete-time queuing system with two head-of-line (HOL) priority queues and a mix of correlated and uncorrelated arrivals. The arrival process to the high priority queue is correlated and consists of a train of a fixed number of fixed-length packets, while the low priority traffic consists of batch arrivals that are independent and identically distributed f...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کامل